-
1 compiler optimization
один из этапов компиляции, на котором с помощью методов оптимизации происходит преобразование программы, сохраняющее её семантику, но уменьшающее размер кода и/или время выполнения. Как правило, уменьшение размера кода увеличивает время выполнения, и наоборот. Поскольку ручная оптимизация программы стоит дорого и занимает много времени, а программисты, работающие на ЯВУ, обычно не знают тонкостей архитектуры конкретного целевого процессора, то сейчас кроме редких случаев используется оптимизация при компиляции, когда компилятор автоматически выбирает наиболее эффективный способ оптимизации и детали реализации в соответствии с заданным уровнем оптимизациисм. тж. antidependence, branch deletion, automatic parallelization, constant folding, constant propagation, control dependence, copy propagation, CSE, data dependence, dead statement, expression folding, fission by name, global forward substitution, GVN, hand optimization, intermediate representation, interprocedural optimization, jump threading, lazy evaluation, induction variable, instruction scheduling, instruction selection, local optimization, loop collapsing, loop invariant code motion, loop inversion, loop parallelization, loop optimization, loop peeling, loop skewing, loop splitting, loop tiling, loop transformation, loop unrolling, loop unrolling and jamming, loop unswitching, loop unwinding, loop vectorization, LNO, optimization, optimization technique, optimizing compiler, output dependence, partial evaluation, peephole optimization, polytope model, PRE, redundant-test elimination, register allocation, register spilling, scalar replacement, SSA, static analysis, strength reduction, strip mining, test promotion, trace scheduling, true dependence, two-version loop, vectorizationАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > compiler optimization
См. также в других словарях:
Loop-invariant code motion — Loop invariant code in an imperative programming language consists of statements which could be moved to before the loop (if the loop always terminates), or after the loop, without affecting the semantics of the program. As a result it is… … Wikipedia
Loop inversion — is a compiler optimization, a loop transformation, which replaces a while loop by an if block containing a do..while loop. Example in C int i, a [100] ; i = 0; while (i < 100) { a [i] = 0; i++; }is equivalent to: int i, a [100] ; i = 0; if (i … Wikipedia
Code bloat — is the production of code that is perceived as unnecessarily long, slow, or otherwise wasteful of resources. Code bloat can be caused by inadequacies in the language in which the code is written, inadequacies in the compiler used to compile the… … Wikipedia
Loop optimization — In compiler theory, loop optimization plays an important role in improving cache performance, making effective use of parallel processing capabilities, and reducing overheads associated with executing loops. Most execution time of a scientific… … Wikipedia
Compiler optimization — is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the… … Wikipedia
Граф потока управления — Простые графы потока управления[1] Граф потока управления (англ. … Википедия
Control flow graph — Simplified control flowgraphs[1] A control flow graph (CFG) in computer science is a representation, using graph notation, of all paths that might be traversed through a program during its execution … Wikipedia
Inline expansion — In computing, inline expansion, or inlining, is a manual or compiler optimization that replaces a function call site with the body of the callee. This optimization may improve time and space usage at runtime, at the possible cost of increasing… … Wikipedia
Dekker's algorithm — is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in his manuscript on cooperating sequential processes.[1] It… … Wikipedia
Partial redundancy elimination — In compiler theory, Partial redundancy elimination (PRE) is a compiler optimization that eliminates expressions that are redundant on some but not necessarily all paths through a program. PRE is a form of common subexpression elimination (CSE).An … Wikipedia
VBCC — is the name of a portable and retargetable ISO/ANSI C compiler.It supports ISO C according to ISO/IEC 9899:1989 and a subset of the new standard ISO/IEC 9899:1999 (C99). It is divided into two parts. One is target independent and the other is… … Wikipedia